Some Fundamental Concepts in (2, L)-Fuzzy Topology Based on Complete Residuated Lattice-Valued Logic

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GENERAL FUZZY AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED

The present paper has been an attempt to investigate the general fuzzy automata on the basis of complete residuated lattice-valued ($L$-GFAs). The study has been chiefly inspired from the work by Mockor cite{15, 16, 17}. Regarding this, the categorical issue of $L$-GFAs has been studied in more details. The main issues addressed in this research include: (1) investigating the relationship betwe...

متن کامل

L-pre-separation axioms in (2, L)-topologies based on complete residuated lattice-valued logic

In the present paper we introduce and study L-pre-T0-, L-pre-T1-, L-pre-T2 (L-pre-Hausdorff)-, L-pre-T3 (L-preregularity)-, L-pre-T4 (L-pre-normality)-, L-pre-strong-T3-, L-pre-strong-T4-, L-pre-R0-, L-pre-R1-separation axioms in (2, L)-topologies where L is a complete residuated lattice. Sometimes we need more conditions on L such as the completely distributive law or that the ”∧” is distribut...

متن کامل

TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS

In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...

متن کامل

FUZZY PREORDERED SET, FUZZY TOPOLOGY AND FUZZY AUTOMATON BASED ON GENERALIZED RESIDUATED LATTICE

This work is towards the study of the relationship between fuzzy preordered sets and Alexandrov (left/right) fuzzy topologies based on generalized residuated lattices here the fuzzy sets are equipped with generalized residuated lattice in which the commutative property doesn't hold. Further, the obtained results are used in the study of fuzzy automata theory.

متن کامل

Fuzzy Roughness in Hyperrings Based on a Complete Residuated Lattice

This paper considers the relations among L -fuzzy sets, rough sets and hyperring theory. Based on a complete residuated lattice, the concept of (invertible) L-fuzzy hyperideals of a hyperring is introduced and some related properties are presented. The notions of lower and upper L-fuzzy rough approximation operators with respect to an L-fuzzy hyperideal are provided and some significant propert...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Fuzzy Logic and Intelligent Systems

سال: 2010

ISSN: 1598-2645

DOI: 10.5391/ijfis.2010.10.3.230